Recently in the news: a purported proof that P ≠ NP. It's an important issue in computational complexity, one of the famous Millennium Problems worth a cool million to the solver.

Recently during an online chat: comrade George tells me that he's been convinced P≠NP ever since he learned about the Boolean satisfiability problem. My reply apparently made him laugh. I wrote:

Mark Zimmermann: I can't get no (Boolean) satisfaction
Mark Zimmermann: though I've tried ...

^z - 2010-08-19